On pseudo 2-factors

AbstractWe show that a graph with minimum degree δ, independence number α≥δ and without isolated vertices, possesses a partition by vertex-disjoint cycles and at most α−δ+1 edges or vertices